Runge–Kutta pairs of order 5(4) satisfying only the first column simplifying assumption
نویسندگان
چکیده
منابع مشابه
Runge-Kutta pairs of order 5(4) satisfying only the first column simplifying assumption
Among the most popular methods for the solution of the Initial Value Problem are the Runge–Kutta pairs of orders 5 and 4. These methods can be derived solving a system of nonlinear equations for its coefficients. For achieving this, we usually admit various simplifying assumptions. The most common of them are the so called row simplifying assumptions. Here we negligible them and present an algo...
متن کاملSatisfying First-Order Constraints About Time Intervals
James Allen defined a calculus of time intervals in [A1183], as a representation of temporal knowledge that could be used in AI. We shall call this the Interval Culculus. In his paper, Allen investigated specification and constraint satisfaction in the Interval Calculus. Other constraintsatisfaction algorithms for intervals have considered subclasses of Boolean formulas only. The methods herein...
متن کاملEffective order strong stability preserving RungeKutta methods
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...
متن کاملAsymptotic Valuations of Sequences Satisfying First Order Recurrences
Let tn be a sequence that satisfies a first order homogeneous recurrence tn = Q(n)tn−1, where Q ∈ Z[n]. The asymptotic behavior of the p-adic valuation of tn is described under the assumption that all the roots of Q in Z/pZ have nonvanishing derivative.
متن کاملThe Total Order Assumption
The total order assumption (TOA) is the assumption that all execution sequences of observable actions or events are totally ordered by precedence. As long as in some cases TOA is to the point, total order and partial order semantics are both legitimate but lead to different theories. I argue that TOA is a simplifying assumption, and present an example of a total order theory without interleavin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.06.002